Preserving Rewrite Proofs ?
نویسندگان
چکیده
منابع مشابه
A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems
We revisit known transformations from Jinja bytecode to rewrite systems from the viewpoint of runtime complexity. Suitably generalising the constructions proposed in the literature, we define an alternative representation of Jinja bytecode (JBC) executions as computation graphs from which we obtain a novel representation of JBC executions as constrained rewrite systems. We prove non-termination...
متن کاملTowards a Domain Theory for Termination Proofs
We present a general framework for termination proofs for Higher Order Rewrite Sys tems The method is tailor made for having simple proofs showing the termination of enriched calculi
متن کاملProof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theories having a so-called pre-model. As a corollary, we retrieve cut elimination for several axiomatic theories, including Church’s simple type theory. Deduction modulo [11] is a formulation of first-order logic, that g...
متن کاملEfficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Deduction modulo is a paradigm which consists in applying the inference rules of a deductive system—such as for instance natural deduction—modulo a rewrite system over terms and propositions. It has been shown that higher-order logic can be simulated into the first-order natural deduction modulo. However, a theorem stated by Gödel and proved by Parikh expresses that proofs in second-order arith...
متن کاملOn h-Lexicalized Restarting Automata
Following some previous studies on restarting automata, we introduce a refined model – the hlexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the input languages, which are the languages traditionally considered in automata theory, to the so-called basic and h-proper languages, which are (impl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007